RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
نویسندگان
چکیده
منابع مشابه
RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
A new graph similarity calculation procedure is introduced for comparing labeled graphs. Given a minimum similarity threshold, the procedure consists of an initial screening process to determine whether it is possible for the measure of similarity between the two graphs to exceed the minimum threshold, followed by a rigorous maximum common edge subgraph (MCES) detection algorithm to compute the...
متن کاملMeasuring Protein Structural Similarity by Maximum Common Edge Subgraphs
It is known that the function of a protein is determined by its structure. Thus, structural similarity between proteins plays an important role as a good predictor of functional similarity. Many methods focus on solving the protein structure alignment problem. In this paper, we propose a graph-based approach to measure the similarity of two proteins. We first transfer a protein into a labeled g...
متن کاملEfficient calculation of compound similarity based on maximum common subgraphs and its application to prediction of gene transcript levels
Properties of a chemical entity, both physical and biological, are related to its structure. Since compound similarity can be used to infer properties of novel compounds, in chemoinformatics much attention has been paid to ways of calculating structural similarity. A useful metric to capture the structural similarity between compounds is the relative size of the Maximum Common Subgraph (MCS). T...
متن کاملSemantic Similarity Calculation Method using Information Contents-based Edge Weighting
In this paper, we propose Semantic Similarity calculation measurement using INformation contents on EdGEs of ontology (SSINEGE) which is a hybrid edgeand information contents-based methodology. SSINEGE is devised to solve the limitation of the applying the same weighted edges by edgebased similarity. So, SSINEGE adopts information-contents theory to calculate the varied weights of edges. The va...
متن کاملOn disjoint matchings in cubic graphs: Maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs
We show that any 2−factor of a cubic graph can be extended to a maximum 3−edge-colorable subgraph. We also show that the sum of sizes of maximum 2− and 3−edge-colorable subgraphs of a cubic graph is at least twice of its number of vertices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 2002
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/45.6.631